Sporadic neighbour-transitive codes in Johnson graphs
نویسندگان
چکیده
We classify the neighbour-transitive codes in Johnson graphs J(v, k) of minimum distance at least 3 which admit a neighbour-transitive group of automorphisms that is an almost simple 2-transitive group of degree v and does not occur in an infinite family of 2-transitive groups. The result of this classification is a table of 22 codes with these properties. Many have relatively large minimum distance in comparison to their length v and number of code words. We construct an additional 5 neighbour-transitive codes with minimum distance 2 admitting such a group. All 27 codes are t-designs with t at least 2.
منابع مشابه
Neighbour-transitive codes in Johnson graphs
The Johnson graph J(v, k) has, as vertices, the k-subsets of a v-set V and as edges the pairs of k-subsets with intersection of size k − 1. We introduce the notion of a neighbour-transitive code in J(v, k). This is a vertex subset Γ such that the subgroup G of graph automorphisms leaving Γ invariant is transitive on both the set Γ of ‘codewords’ and also the set of ‘neighbours’ of Γ, which are ...
متن کاملHomogeneous factorisations of Johnson graphs
For a graph Γ, subgroups M < G 6 Aut(Γ), and an edge partition E of Γ, the pair (Γ, E) is a (G, M)-homogeneous factorisation if M is vertex-transitive on Γ and fixes setwise each part of E , while G permutes the parts of E transitively. A classification is given of all homogeneous factorisations of finite Johnson graphs. There are three infinite families and nine sporadic examples.
متن کاملOn Sets with Few Intersection Numbers in Finite Projective and Affine Spaces
In this paper we study sets X of points of both affine and projective spaces over the Galois field GF(q) such that every line of the geometry that is neither contained in X nor disjoint from X meets the set X in a constant number of points and we determine all such sets. This study has its main motivation in connection with a recent study of neighbour transitive codes in Johnson graphs by Liebl...
متن کاملNeighbour transitivity on codes in Hamming graphs
We consider a code to be a subset of the vertex set of a Hamming graph. In this setting a neighbour of the code is a vertex which differs in exactly one entry from some codeword. This paper examines codes with the property that some group of automorphisms acts transitively on the set of neighbours of the code. We call these codes neighbour transitive. We obtain sufficient conditions for a neigh...
متن کاملEntry-faithful 2-neighbour transitive codes
We consider a code to be a subset of the vertex set of a Hamming graph. The set of s-neighbours of a code is the set of vertices, not in the code, at distance s from some codeword, but not distance less than s from any codeword. A 2-neighbour transitive code is a code which admits a group X of automorphisms which is transitive on the s-neighbours, for s = 1, 2, and transitive on the code itself...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 72 شماره
صفحات -
تاریخ انتشار 2014